Decidability of Higher-Order Subtyping with Intersection Types

The combination of higher-order subtyping with intersection types yields a typed model of object-oriented programming with multiple inheritance 11]. The target calculus, F ! ^ , a natural generalization of Girard's system F ! with intersection types and bounded polymorphism, is of independent interest, and is our subject of study. Our main contribution is the proof that subtyping in F ! ^ is decidable. This yields as a corollary the decidability of subtyping in F ! , its intersection free fragment, because the F ! ^ subtyping system is a conservative extension of that of F !. The calculus presented in 8] has no reductions on types. In the F ! ^ sub-typing system the presence of ^-conversion { an extension of-conversion with distributivity laws { drastically increases the complexity of proving the decidability of the subtyping relation. Our proof consists of, rstly, deening an algorithmic presentation of the subtyping system of F ! ^ , secondly , proving that this new presentation is sound and complete with respect to the original one, and nally, proving that the algorithm always terminates. Moreover, we establish basic structural properties of the language of types of F ! ^ such as strong normalization and Church-Rosser. Among the novel aspects of the present solution is the use of term rewriting techniques to present intersection types, which clearly splits the computational semantics (reduction rules) from the syntax (inference rules) of the system. Another original feature is the use of a choice operator to model the behavior of variables during subtype checking.